A Probability Collectives Approach with a Feasibility-Based Rule for Constrained Optimization
نویسندگان
چکیده
منابع مشابه
Probability Collectives - A Distributed Multi-agent System Approach for Optimization
Introducing a new hobby for other people may inspire them to join with you. Reading, as one of mutual hobby, is considered as the very easy hobby to do. But, many people are not interested in this hobby. Why? Boring is the reason of why. However, this feel actually can deal with the book and time of you reading. Yeah, one that we will refer to break the boredom in reading is choosing probabilit...
متن کاملConstrained Ordinal Optimization - A Feasibility Model Based Approach
Ordinal Optimization (OO) is a useful simulation-based approach for stochastic optimization problems such as the problems in Discrete Event Dynamic Systems (DEDS). However, OO cannot be applied directly for the problem since many infeasible decisions cannot be excluded from ordinal comparison without extensive computation involving the expectation operation. In this paper, a new approach for so...
متن کاملFirefly Algorithm with a Feasibility-Based Rules for Constrained Optimization
Firefly algorithm (FA) is recently developed nature-inspired metaheuristic based on the flashing patterns and behaviour of fireflies. Original FA was successfully applied to solve unconstrained optimization problems. This paper presents firefly algorithm to solve constrained optimization problems. For constraint handling, firefly algorithm uses certain feasibility-based rules in order to guide ...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملProbability Collectives: A Decentralized, Distributed Optimization for Multi-Agent Systems
Complex systems may have many components that not only interact but also compete with one another to deliver the best they can to reach the desired system objective. As the number of components grows, complexity and communication also grow, making them computationally cumbersome to be treated in a centralized way. It may be better to handle them in a distributed way and decomposed into componen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Computational Intelligence and Soft Computing
سال: 2011
ISSN: 1687-9724,1687-9732
DOI: 10.1155/2011/980216